Semi-algebraic Approximation Using Christoffel–Darboux Kernel

نویسندگان

چکیده

We provide a new method to approximate (possibly discontinuous) function using Christoffel–Darboux kernels. Our knowledge about the unknown multivariate is in terms of finitely many moments Young measure supported on graph function. Such an input available when approximating weak (or measure-valued) solution optimal control problems, entropy solutions nonlinear hyperbolic PDEs, or numerical integration from evaluations While most existing methods construct piecewise polynomial approximation, we semi-algebraic approximation whose estimation and evaluation can be performed efficiently. An appealing feature this that it deals with nonsmoothness implicitly so single scheme used treat smooth nonsmooth functions without any prior knowledge. On theoretical side, prove pointwise convergence almost everywhere as well Lebesgue one norm under broad assumptions. Using more restrictive assumptions, obtain explicit rates. illustrate our approach various examples approximation. In particular, observe empirically does not suffer Gibbs phenomenon discontinuous functions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension

We consider n-dimensional semi-algebraic spatial databases. We compute in first-order logic extended with a transitive closure operator, a linear spatial database which characterizes the semi-algebraic spatial database up to a homeomorphism. In this way, we generalize our earlier results to semi-algebraic spatial databases in arbitrary dimensions, our earlier results being true for only two dim...

متن کامل

Support Vector Machine Approximation using Kernel PCA

Support Vector Machine is a very important technique used for classification and regression. Although very accurate, the speed of SVM classification decreases with increase in the number of support vectors. This paper describes one method of reducing the number of support vectors through the application of Kernel PCA. This method is different from other proposed methods as we show that the exac...

متن کامل

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

Semi-algebraic neighborhoods of closed semi-algebraic sets

— Given a closed (not necessarly compact) semi-algebraic set X in Rn, we construct a non-negative semi-algebraic C2 function f such that X=f−1(0) and such that for δ > 0 sufficiently small, the inclusion of X in f−1([0, δ]) is a retraction. As a corollary, we obtain several formulas for the Euler characteristic of X. Résumé. — Étant donné un ensemble semi-algébrique fermé (non nécessairement co...

متن کامل

Kernel Selection for Semi-Supervised Kernel Machines

Existing semi-supervised learning methods are mostly based on either the cluster assumption or the manifold assumption. In this paper, we propose an integrated regularization framework for semi-supervised kernel machines by incorporating both the cluster assumption and the manifold assumption. Moreover, it supports kernel learning in the form of kernel selection. The optimization problem involv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Constructive Approximation

سال: 2021

ISSN: ['0176-4276', '1432-0940']

DOI: https://doi.org/10.1007/s00365-021-09535-4